An Ehrenfeucht-fraïssé Game for Inquisitive First-order Logic
نویسندگان
چکیده
Inquisitive first-order logic, InqBQ, extends classical first-order logic with questions. From a technical perspective, InqBQ allows us to talk about a plurality of first-order structures, expressing not only facts about each structure in isolation, but also about how these structures relate to each other. We describe an Ehrenfeucht-Fräıssé game for InqBQ and show that this characterizes the expressive power of the logic. We illustrate the usefulness of the result by giving a game-theoretic proof of the fact that certain cardinality properties are not expressible in InqBQ.
منابع مشابه
Easier Ways to Win Logical Games
The key tool in proving inexpressibility results in finite-model theory is Ehrenfeucht-F'rai'ss6 games. This paper surveys various game-theoretic techniques and tools that lead to simpler proofs of inexpressibility results. The focus is on first-order logic and
متن کاملA Friendly Introduction to Ehrenfeucht-Fräıssé Games
Assuming some basic familiarity with ordinal arithmetic, we provide a friendly introduction to the theory of Ehrenfeucht-Fräıssé games. 1 What Is An Ehrenfeucht-Fräıssé Game? Ehrenfeucht-Fräıssé (EF) games were first developed in the 50’s and 60’s by Andrzej Ehrenfeucht and Roland Fräıssé. Although Fräıssé developed much of the background theory and some important applications in his doctoral d...
متن کاملAn Ehrenfeucht-Fraisse Game Approach to Collapse Results in Database Theory
We present a new Ehrenfeucht-Fraı̈ssé game approach to collapse results in database theory. We show that, in principle, every natural generic collapse result may be proved via a translation of winning strategies for the duplicator in an Ehrenfeucht-Fraı̈ssé game. Following this approach we can deal with certain infinite databases where previous, highly involved methods fail. We prove the natural ...
متن کاملAn Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases
We present a new proof technique for collapse results for first–order queries on databases which are embedded in N or R>0. Our proofs are by means of an explicitly constructed winning strategy for Duplicator in an Ehrenfeucht–Fräıssé game, and can deal with certain infinite databases where previous, highly involved methods fail. Our main result is that first–order logic has the natural–generic ...
متن کاملAn Ehrenfeucht-Fraı̈ssé Game Approach to Collapse Results in Database Theory
We present a new Ehrenfeucht-Fraı̈ssé game approach to collapse results in database theory. We show that, in principle, every natural generic collapse result may be proved via a translation of winning strategies for the duplicator in an Ehrenfeucht-Fraı̈ssé game. Following this approach we can deal with certain infinite databases where previous, highly involved methods fail. We prove the natural ...
متن کامل